610B - Vika and Squares - CodeForces Solution

#include <bits/stdc++.h>

#define len(a) sizeof(a)/sizeof(a[0])
using namespace std;
#define ll long long
#define fill(a,x) memset(a,x,sizeof(a));
const ll m = 1e9+7;

int main(){
  ll n; cin >> n;
  ll a[n],m = 1e9+1;
  ll d = 0,s = 0;
  for(ll i = 0; i < n; i++) cin >> a[i], m = min(m,a[i]);
  d = find(a,a+n,m) - a;
  for(ll i = n-1; i >= 0; i--){
      if(a[i] == m){
        s = max(s,d);
        d = 0;
      }
      else d += 1;   
  }
  // cout << first << " " << last << endl;
  // cout << d << endl;
  cout << m*n + s;
}